Extension of an approximate orthogonalization algorithm to arbitrary rectangular matrices
نویسندگان
چکیده
منابع مشابه
On numerical solution of arbitrary symmetric linear systems by approximate orthogonalization
For many important real world problems, after the application of appropriate discretization techniques we can get symmetric and relatively dense linear systems of equations (e.g. those obtained by collocation or projection-like discretization of first kind integral equations). Usually, these systems are rankdefficient and (very) ill-conditioned, thus classical direct or iterative solvers can no...
متن کاملan infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملOn the orthogonalization of arbitrary Boolean formulae
The orthogonal conjunctive normal form of a Boolean function is a conjunctive normal form in which any two clauses contain at least a pair of complementary literals. Orthogonal disjunctive normal form is defined similarly. Orthogonalization is the process of transforming the normal form of a Boolean function to orthogonal normal form. The problem is of great relevance in several applications, f...
متن کاملAn iterative algorithm for approximate orthogonalisation of symmetric matrices
In a previous paper one of the authors presented an extension of an iterative approximate orthogonalisation algorithm, due to Z. Kovarik, for arbitrary rectangular matrices. In the present paper we propose a modified version of this extension, for the class of arbitrary symmetric matrices. For this new algorithm, the computational effort per iteration is much smaller than for the initial one. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2001
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(01)00286-5